Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("BIPARTITE GRAPH")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2190

  • Page / 88
Export

Selection :

  • and

WHEN IS A BIPARTITE GRAPH A RIGID FRAMEWORK.BOLKER ED; ROTH B.1980; PAC. J. MATH.; ISSN 0030-8730; USA; DA. 1980; VOL. 90; NO 1; PP. 27-44; BIBL. 6 REF.Article

RESULTATS RECENTS SUR CERTAINES CLASSES D'HYPERGRAPHES QUI GENERALISENT LES GRAPHES BIPARTISBERGE C.1978; CAH. CENTRE ET. RECH. OPERAT.; BEL; DA. 1978; VOL. 20; NO 3-4; PP. 243-278; BIBL. 73 REF.Article

A TOUR THROUGH TOURNAMENTS OR BIPARTITE AND ORDINARY TOURNAMENTS: A COMPARATIVE SURVEYBEINEKE LW.1981; LECT. NOTE SER.-LONDON MATH. SOC.; ISSN 0076-0552; GBR; DA. 1981; NO 52; PP. 41-55Conference Paper

LOCAL COMPLEMENTATION AND INTERLACEMENT GRAPHSDE FRAYSSEIX H.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 1; PP. 29-35; BIBL. 10 REF.Article

THE ENUMERATION OF BIPARTITE GRAPHSHANLON P.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 28; NO 1; PP. 49-57; BIBL. 5 REF.Article

NEAREST S-MATRICES OF GIVEN RANK AND THE RAMSEY PROBLEM FOR EIGENVALUES OF BIPARTITE S-GRAPHSHOFFMAN AJ; JOFFE P.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 237-240; ABS. FRE; BIBL. 6 REF.Conference Paper

BIPARTITE GRAPHS WITH A CENTRAL SYMMETRY AND (1,-1)-MATRICESBERMAN A; KOTZIG A.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 8; PP. 37-42; BIBL. 8 REF.Conference Paper

PERFECTNESS OF NORMAL PRODUCTS OF GRAPHSRAVINDRA G.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 24; NO 3; PP. 291-298; BIBL. 7 REF.Article

AN EXPLICATION OF RADO'S THEOREM TO DISJOINT MATCHINGS IN BIPARTITE GRAPHS.MURTHY USR.1978; J. LONDON MATH. SOC.; G.B.; DA. 1978; VOL. 17; NO 2; PP. 193-194; BIBL. 3 REF.Article

ON A CLASS OF HYPERGRAPHS OCCURRING IN CHROMATIC SCHEDULINGDE WERRA D.1979; CAH. CENTRE ET. RECH. OPERAT.; BEL; DA. 1979; VOL. 21; NO 3; PP. 239-245; BIBL. 9 REF.Article

ORIENTABLE AND NONORIENTABLE GENUS OF THE COMPLETE BIPARTITE GRAPH.BOUCHET A.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 1; PP. 24-33; BIBL. 3 REF.Article

CODES IN BIPARTITE DISTANCE-REGULAR GRAPHS.BANNAI E.1977; J. LONDON MATH. SOC.; G.B.; DA. 1977; VOL. 16; NO 2; PP. 197-202; BIBL. 11 REF.Article

ON MINIMAL ELEMENTARY BIPARTITE GRAPHS.LOVASZ L; PLUMMER MD.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 23; NO 1; PP. 127-138; BIBL. 7 REF.Article

THE DIAGONAL HYPERGRAPH OF A MATRIX (BIPARTITE GRAPH)BRUALDI RA.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 27; NO 2; PP. 127-147; BIBL. 7 REF.Article

AN EFFICIENT PRIMAL SIMPLEX ALGORITHM FOR MAXIMUM WEIGHTED VERTEX PACKING ON BIPARTITE GRAPHSIKURA Y; NEMHAUSER GL.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 149-168; BIBL. 15 REF.Conference Paper

FEASIBLE SEQUENCES OF ALMOST BIPARTITE GRAPHSDE WERRA D.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 427-429; ABS. FRE; BIBL. 8 REF.Conference Paper

AN EDGE-COLORATION THEOREM FOR BIPARTITE GRAPHS WITH APPLICATIONSRAM PRAKASH GUPTA.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 23; NO 3; PP. 229-233; BIBL. 8 REF.Article

ON MAXIMUM BIPARTITE SUBGRAPHSMALLE G.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 2; PP. 105-113; BIBL. 3 REF.Article

THE DIAMETER OF BIPARTITE DISTANCE-REGULAR GRAPHSTERWILLIGER P.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 2; PP. 182-188; BIBL. 8 REF.Article

GENERALIZED RAMSEY THEORY FOR GRAPHS. XII: BIPARTITE RAMSEY SETSHARARY F; HARBORTH H; MENGERSEN I et al.1981; GLASG. MATH. J.; ISSN 0017-0895; GBR; DA. 1981; VOL. 22; NO 1; PP. 31-41; BIBL. 7 REF.Article

FAST RECOGNITION OF BAXTER PERMUTATIONS USING SYNTACTICAL AND COMPLETE BIPARTITE COMPOSITE DAG'SHART JM.1980; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1980; VOL. 9; NO 4; PP. 307-321; BIBL. 12 REF.Article

BIPARTITE GRAPHS AND AN OPTIMAL BORDERED TRIANGULAR FORM OF A MATRIXSANGIOVANNI VINCENTELLI A; BICKART TA.1979; I.E.E.E. TRANS. CIRCUITS SYST.; USA; DA. 1979; VOL. 26; NO 10; PP. 880-889; BIBL. 24 REF.Article

DECOMPOSITION OF COMPLETE BIPARTITE GRAPHS INTO FACTORS WITH GIVEN RADII.TOMOVA E.1977; MATH. SLOV.; TCHECOSL.; DA. 1977; VOL. 27; NO 3; PP. 231-237; ABS. RUSSE; BIBL. 5 REF.Article

ON TWO-FACTORS OF BIPARTITE REGULAR GRAPHSHORTON JD.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 1; PP. 35-41; BIBL. 5 REF.Article

ON THE STRUCTURES INDUCED BY BIPARTITE GRAPHS AND INFINITE MATROIDS.GYORI E.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 22; NO 3; PP. 257-261; BIBL. 3 REF.Article

  • Page / 88